Sparse Representations and Realization Theory
نویسنده
چکیده
We present some results obtained recently in signal processing in the so-called “sparse representations” domain and indicate how they can be applied to a very specific and limited problem in realization theory. This is mainly to bring these type of results to the knowledge of this community. Other applications in order estimation for instance are potentially feasible. The basic problem is the following: given a (n, m)-matrix A with m > n and a vector b = Axo with xo having p non-zero components, find sufficient conditions for xo to be the unique sparsest solution of Ax = b, the answer is a upper-bound on p depending upon A. We present as application the realization of a partial covariance sequences.
منابع مشابه
Image Classification via Sparse Representation and Subspace Alignment
Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...
متن کاملFace Recognition in Thermal Images based on Sparse Classifier
Despite recent advances in face recognition systems, they suffer from serious problems because of the extensive types of changes in human face (changes like light, glasses, head tilt, different emotional modes). Each one of these factors can significantly reduce the face recognition accuracy. Several methods have been proposed by researchers to overcome these problems. Nonetheless, in recent ye...
متن کاملSparse representations and approximation theory
This paper is an attempt to both expound and expand upon, from an approximation theorist’s point of view, some of the theoretical results that have been obtained in the sparse representation (compressed sensing) literature. In particular, we consider in detail l1 -approximation, which is fundamental in the theory of sparse representations, and the connection between the theory of sparse represe...
متن کاملSparse Hidden Markov Models for Exemplar-based Speech Recognition Using Deep Neural Network Posterior Features
Statistical speech recognition has been cast as a natural realization of the compressive sensing and sparse recovery. The compressed acoustic observations are sub-word posterior probabilities obtained from a deep neural network (DNN). Dictionary learning and sparse recovery are exploited for inference of the high-dimensional sparse word posterior probabilities. This formulation amounts to reali...
متن کاملSparse Hidden Markov Models for Automatic Speech Recognition
Stochastic speech recognition has been cast as a natural realization of the compressive sensing problem in this work. The compressed acoustic observations are subword posterior probabilities obtained from a deep neural network. Dictionary learning and sparse recovery are exploited for inference of the high-dimensional sparse word posterior probabilities. This formulation amounts to realization ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006